class Solution:
	# @param {string} s
	# @return {string[]}
	def findRepeatedDnaSequences(self, s):
		if len(s) < 11:
			return []
		pool = set()
		ans = set()
		for i in range(len(s)-9):
			currstr = s[i:i+10]
			if currstr not in pool:
				pool.add(currstr)
			else:
				ans.add(currstr)
		return list(ans)

if __name__ == '__main__':
	print Solution().findRepeatedDnaSequences('AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT')